Some results on counting roots of polynomials and the Sylvester resultant
نویسندگان
چکیده
We present two results, the first on the distribution of the roots of a polynomial over the ring of integers modulo n and the second on the distribution of the roots of the Sylvester resultant of two multivariate polynomials. The second result has application to polynomial GCD computation and solving polynomial diophantine equations.
منابع مشابه
Sylvester double sums and subresultants
Sylvester double sums versus subresultants given two polynomials A and B first notion symmetric expression of the roots of two polynomials second notion defined through the coefficients polynomials main result of the lecture these two notions are very closely related (idea due to Sylvester [S]) see details and complete proofs in [RS]. 1 Definitions and main result. A and B two finite families o...
متن کاملOn the resultant of degree-deficient polynomials
The resultant is an algebraic expression, computable in a finite number of arithmetic operations from the coefficients of two univariate polynomials, that vanishes if, and only if, the two polynomials have common zeros. The paper considers formal resultant for degree-deficient polynomials (polynomials whose actual degree is lower than their assumed degree). Some key properties of the resultant ...
متن کاملResultants and Loop Closure
The problem of tripeptide loop closure is formulated in terms of the angles { i}i 1 3 describing the orientation of each peptide unit about the virtual axis joining the C atoms. Imposing the constraint that at the junction of two such units the bond angle between the bonds C ON and C OC is fixed at some prescribed value results in a system of three bivariate polynomials in ui : tan i/2 of degre...
متن کاملOn the resultant property of the Fisher information matrix of a vector ARMA process
A matrix is called a multiple resultant matrix associated to two matrix polynomials when it becomes singular if and only if the two matrix polynomials have at least one common eigenvalue. In this paper a new multiple resultant matrix is introduced. It concerns the Fisher information matrix (FIM) of a stationary vector autoregressive and moving average time series process (VARMA). The two matrix...
متن کاملOn Counting Polynomials of Some Nanostructures
The Omega polynomial(x) was recently proposed by Diudea, based on the length of strips in given graph G. The Sadhana polynomial has been defined to evaluate the Sadhana index of a molecular graph. The PI polynomial is another molecular descriptor. In this paper we compute these three polynomials for some infinite classes of nanostructures.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1609.08712 شماره
صفحات -
تاریخ انتشار 2016